中国邮电高校学报(英文) ›› 2010, Vol. 17 ›› Issue (4): 110-115.doi: 10.1016/S1005-8885(09)60496-9

• Others • 上一篇    下一篇

Method for replica creation in data grids based on complex networks

陈丹伟,任勋益,周书桃,KONG Qiang   

  1. 南京邮电大学
  • 收稿日期:2010-01-05 修回日期:2010-05-19 出版日期:2010-08-30 发布日期:2010-08-31
  • 通讯作者: 陈丹伟 E-mail:chendw@njupt.edu.cn
  • 基金资助:

    This work was supported by the National Natural Science Foundation of China (60973139, 60773041), the Key Technologies R&D Program of China (2007BAK34B06), the Talent Foundation of Nanjing Universitiy of Posts and Telecommunications (NY208006).

Method for replica creation in data grids based on complex networks

CHEN Dan-wei , ZHOU Shu-tao, REN Xun-yi, KONG Qiang   

  1. College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China
  • Received:2010-01-05 Revised:2010-05-19 Online:2010-08-30 Published:2010-08-31
  • Contact: Chen Dan-wei E-mail:chendw@njupt.edu.cn
  • Supported by:

    This work was supported by the National Natural Science Foundation of China (60973139, 60773041), the Key Technologies R&D Program of China (2007BAK34B06), the Talent Foundation of Nanjing Universitiy of Posts and Telecommunications (NY208006).

摘要:

In order to reduce makespan and storage consumption in data grids, a node selection model for replica creation is proposed. The model is based on the degree distribution of complex networks. We define two candidate replica nodes: a degree-based candidate pool and a frequency-based candidate pool, through which a degree-based candidate pool is defined in consideration of onsidering the access frequency; a candidate pool-based frequency is also defined. The data replica is copied to the node with the minimum local cost in the two pools. Further, this paper presents and proves a replica creation theorem. A dynamic multi-replicas creation algorithm (DMRC) is also provided. Simulation results show that the proposed method may simultaneously reduce makespan and data used in space storage consumption.

关键词:

data grid, replica creation, complex networks

Abstract:

In order to reduce makespan and storage consumption in data grids, a node selection model for replica creation is proposed. The model is based on the degree distribution of complex networks. We define two candidate replica nodes: a degree-based candidate pool and a frequency-based candidate pool, through which a degree-based candidate pool is defined in consideration of onsidering the access frequency; a candidate pool-based frequency is also defined. The data replica is copied to the node with the minimum local cost in the two pools. Further, this paper presents and proves a replica creation theorem. A dynamic multi-replicas creation algorithm (DMRC) is also provided. Simulation results show that the proposed method may simultaneously reduce makespan and data used in space storage consumption.

Key words:

data grid, replica creation, complex networks